Coordination mechanisms for selfish scheduling
نویسندگان
چکیده
منابع مشابه
Coordination Mechanisms for Selfish Scheduling
In machine scheduling, a set of n jobs must be scheduled on a set of m machines. Each job i incurs a processing time of pij on machine j and the goal is to schedule jobs so as to minimize some global objective function, such as the maximum makespan of the schedule considered in this paper. Often in practice, each job is controlled by an independent selfish agent who chooses to schedule his job ...
متن کاملMechanisms for scheduling games with selfish players
Acknowledgments A Ph.D. thesis is the product of several years of work and, therefore, influenced by a lot of people. Here I would like to thank all of you who contributed, in one way or another, to me being able to finish this work. The following people deserve a special mention. First of all I thank Marc Uetz for the supervision during this trajectory. Starting with the final project of my ma...
متن کاملA Coordination Mechanism for Selfish Scheduling, Review from Average Perspective
In this paper, we design and analyse coordination mechanisms for different variants of selfish scheduling. We assume that jobs are selfish and decide to go to a machine to minimize their disutility. In a coordination mechanism, the disutility of each job is computed only based of the set of jobs that are scheduled on the same machine. We are interested in properties of the global solution impos...
متن کاملCoordination Mechanism for Selfish Scheduling, Review from Average Perspective
In this paper, we design and analyse coordination mechanisms for different variants of selfish scheduling. We assume that jobs are selfish and decide to go to a machine to minimize their disutility. In a coordination mechanism, the disutility of each job is computed only based of the set of jobs that are scheduled on the same machine. We are interested in properties of the global solution impos...
متن کاملCoordination Mechanisms for Selfish Routing over Time on a Tree
While selfish routing has been studied extensively, the problem of designing better coordination mechanisms for routing over time in general graphs has remained an open problem. In this paper, we focus on tree networks (single source multiple destinations) with the goal of minimizing (weighted) average sojourn time of jobs, and provide the first coordination mechanisms with provable price of an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.12.032